|
|
Parser and Validator of Data Models in YANG Language
Vican, Pavol ; Kekely, Lukáš (referee) ; Kořenek, Jan (advisor)
Computer network administrators need tools for configuration and monitoring of network devices. Therefore, NETCONF protocol was designed for remote devices configuration and YANG modelling language which describes the structure of the configuration data. The aim of this thesis is to extend the libyang library with syntax parser, that processes models written in YANG and stores them into internal structures. This parser is generated by bison and flex tools.
|
|
|
Compiler of a Language with User-Defined Syntax for New Constructs
Kuklínek, Lukáš ; Křivka, Zbyněk (referee) ; Kolář, Dušan (advisor)
Tato práce si klade za cíl navrhnout a implementovat experimentální programovací jazyk s podporou uživatelsky definovaných syntaktických konstrukcí. Nový jazyk je kompilován do nativní binární podoby a vyžaduje statickou typovou disciplínu v době překladu. Jazyk se skládá ze dvou hlavních komponent. První z nich je minimalistické jádro založené na principech zásobníkově orientovaných jazyků. Druhou částí je mechanismus pro definici nových syntaktických konstrukcí uživatelem. Poté jsou shrnuty poznatky nabyté při návrhu a experimentování s prototypem překladače tohoto jazyka.
|
|
|
Parallel Parsing
Holko, Maroš ; Regéciová, Dominika (referee) ; Meduna, Alexandr (advisor)
The goal of this bachelor thesis is to create and implement a parallel version of a Cocke-Younger-Kasami algorithm, which is used for syntactic analysis. This algorithm works with context-free grammars, so a big part of this work is dedicated to context-free grammars and their transformation to the Chomsky normal form. Output of this thesis is console application in C++ which use threads for parallel processing. There is also an extension for finding all rule successions for given input string designed and implemented. In the end there is a discussion about program's advantages and disadvantages.
|
|
|
Modified Parsing
Sopuch, Zbyněk ; Rychnovský, Lukáš (referee) ; Meduna, Alexandr (advisor)
This project deals with modification of syntax analysis. I realize three modifications of bottom up algorithm. First way is modification of Cocke-Younger-Kasami algorithm, second is based on EOL system and third is based on ETOL system.
|
|
|
Sequential and Parallel Grammars: Properties and Applications
Klobučníková, Dominika ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
This thesis deals with the topic of sequential and parallel grammars. Both of these groups cover a large number of grammar families, most of which, however, are not widely used because of the difficulties related to their processing. The thesis examines some of these grammar types, such as scattered-context grammars, multigenerative systems, and interactive L-systems, with focus on their normal forms. Subsequently, it introduces a set of algorithms utilising properties of the discussed grammar types as well as their normal forms. These algorithms are based on the Cocke-Younger-Kasami algorithm for context-free grammars, and are capable of parsing any grammar in the corresponding normal form. Finally, a program implementing the proposed algorithms is presented.
|
|
|
Script Language for Image Processing
Crlík, Radek ; Španěl, Michal (referee) ; Zemčík, Pavel (advisor)
This bachelor thesis deals with capabilities of scripting languages and their types. Specifically with design of one such language suitable for image processing. The goal was to create a language small enough, but easy to use. One of the requirement was to utilize OpenCV library, for which the resulting code would be as short as possible. First part deals with descriptions of scripting languages, their main philosophy and options of language processing by the computer. Second part contains description of the designed language. Last part documents achieved goals and possible ways how to extend the language even further.
|
|
|
A LaTex Interpreter Based on a Combination of Several Parsing Methods
Lebeda, Petr ; Techet, Jiří (referee) ; Meduna, Alexandr (advisor)
The diploma thesis discusses the potential of interpretation of typographical language LATEX and describes the structure of this language, its functions and their syntax. Also it analyses possibilities of LaTeX interpretation into HTML (HyperText Markup Language), in order to create typographically accurate publications, which could be viewed by common web browser. The solution concept and outlines of possible problems follows.
|
|
|
General Grammars: Normal Forms with Applications
Klobučníková, Dominika ; Krčmář, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis deals with the topic of unrestricted grammars, normal forms, and their applications. It focuses on context-sensitive grammars as their special cases. Based on the analysis of the set, an algorithm was designed using the principles of the Cocke-Younger-Kasami algorithm to make a decision of whether an input string is a sentence of a context-sensitivegrammar. The final application, which implements this algorithm, works with context-sensitive grammars in the Penttonen normal form.
|
|
|
Grammar Systems Applied to Compilation
Reš, Jakub ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
The main goal of this work is to design a method of constructing a compiler based on grammar systems that allows it's user to by able to combine any existing construction methods. Solution of this problem lies in utilization of cooperating distributed grammar systems. The principle of dividing compiler into sequentially cooperating components was used by this thesis. So we have a construction of smaller, narrowly specified units that are able to pass control to each other and together analyze complex languages. Each of these components is using one of the existing methods of analysis and any way of it's implementation. Benefit of this thesis is the design of construction method using principle of grammar systems, that allows us to use combination of any existing methods and brings overall higher generative power, and showing a possible way of using this method.
|
|
| |
guest ::
